Computationally Efficient Graph Matching via Energy Vector Extraction
ثبت نشده
چکیده
This paper presents a method for graph matching based on domain knowledge by quantifying representative graph features. Our method searches and extracts the most relevant cues in different graphs. Once these cues are extracted and quantified, a new energy function is used to match the different graphs based on the obtained features values. This approach has been successfully applied for deformable template matching. As a result the error of matching is reduced, as well as the computational cost by efficiently selecting and grouping representative features.
منابع مشابه
Contourlet Based Finger Print Matching
This paper describes a novel approach to finger print matching using a new mathematical transform: the contourlet transform. Contourlet improves traditional wavelet based approaches by incorporating a directional component. It finds a direct discrete-space construction and is therefore computationally efficient. In this paper, 2-D spectrum is divided into fine slices using iterated directional ...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملApplication of Graph Embedding to solve Graph Matching Problems
Résumé : Graphs have very interesting properties for object representation in pattern recognition. However, graph matching algorithms are usually computationally complex. In addition, graphs are harder to manipulate and operate than feature vectors. In the last years, some attempts have been made to combine the best of the graph and the vector domains in order to get the advantages of both worl...
متن کاملComputationally Efficient Long Horizon Model Predictive Direct Current Control of DFIG Wind Turbines
Model predictive control (MPC) based methods are gaining more and more attention in power converters and electrical drives. Nevertheless, high computational burden of MPC is an obstacle for its application, especially when the prediction horizon increases extends. At the same time, increasing the prediction horizon leads to a superior response. In this paper, a long horizon MPC is proposed to c...
متن کاملMany-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often the case that a more meaningful correspondence exists between a cluster of nodes in one graph and a cluster of nodes in the other. We present a matching algorithm that establishes many-to-many correspondences between ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007